Codes from Symmetry Groups, and a [32, 17, 8] Code

نویسندگان

  • Ying Cheng
  • N. J. A. Sloane
چکیده

Let G be the automorphism group of the four-dimensional cube, a group of order24 . 4 ! = 384. The binary codes associated with the 32-dimensional permutationrepresentation of G on the edges of the cube are investigated. There are about 400 suchcodes, one of which is a [32, 17, 8] code, having twice as many codewords as the[32, 16, 8] extended quadratic residue code. __________* This paper appeared in SIAM J. Discrete Math., vol. 2 (1989), pp. 28–37.** Present address: AT&T; Bell Laboratories, Holmdel, NJ 07733.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The automorphism group of an [18, 9, 8] quaternary code

An [18, 9, 8] extremal self-dual code over GF( 4 ) and related [17, 4, 12], [17, 8, 8],[17, 9, 7], [17, 13, 4] codes are investigated. Simple coordinates are given for these codes,and their minimal weight codewords and automorphism groups are determined. Thegroups are all isomorphic to 3 × (PSL 2 ( 16 ). 4 ). __________* This appeared in ‘‘Discrete Math.’’, vol. 83 (1990), pp. 2...

متن کامل

Binary doubly - even self - dual codes of length 72 with large automorphism groups ∗

We study binary linear codes constructed from fifty-four Hadamard 2-(71, 35, 17) designs. The constructed codes are self-dual, doubly-even and self-complementary. Since most of these codes have large automorphism groups, they are suitable for permutation decoding. Therefore we study PD-sets of the obtained codes. We also discuss the errorcorrecting capability of the obtained codes by majority l...

متن کامل

On binary codes related to mutually quasi-unbiased weighing matrices

Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying the conditions that the number of non-zero weights of the code is four and the code contains the first order Reed–Muller code. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes satisfying the conditions are determined. We also give ...

متن کامل

On the automorphism groups of the Z2 Z4 -linear 1-perfect and Preparata-like codes

We consider the symmetry group of a Z2Z4-linear code with parameters of a 1-perfect, extended 1-perfect, or Preparata-like code. We show that, provided the code length is greater than 16, this group consists only of symmetries that preserve the Z2Z4 structure. We find the orders of the symmetry groups of the Z2Z4-linear (extended) 1-perfect codes.

متن کامل

Permutation decoding for codes from designs, finite geometries and graphs

The method of permutation decoding was first developed by MacWilliams in the early 60’s and can be used when a linear code has a sufficiently large automorphism group to ensure the existence of a set of automorphisms, called a PD-set, that has some specifed properties. These talks will describe some recent developments in finding PD-sets for codes defined through the row-span over finite fields...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 2  شماره 

صفحات  -

تاریخ انتشار 1989